Computing and analyzing recoverable supports for sparse reconstruction
نویسندگان
چکیده
منابع مشابه
Computing and Analyzing Recoverable Supports for Sparse Reconstruction
Designing computational experiments involving `1 minimization with linear constraints in a finite-dimensional, real-valued space for receiving a sparse solution with a precise number k of nonzero entries is, in general, difficult. Several conditions were introduced which guarantee that, for small k and for certain matrices, simply placing entries with desired characteristics on a randomly chose...
متن کاملOn Maximally Recoverable Local Reconstruction Codes
In recent years the explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction Codes (LRCs) have emerged as the codes of choice for these applications. An (n, r ,h,a,q)-LRC is a q-ary code, where encoding is as a two stage process. In the first stage, h redundant parity symbols are generate...
متن کاملPhylogenomic reconstruction supports supercontinent origins for Leishmania.
Leishmania, a genus of parasites transmitted to human hosts and mammalian/reptilian reservoirs by an insect vector, is the causative agent of the human disease complex leishmaniasis. The evolutionary relationships within the genus Leishmania and its origins are the source of ongoing debate, reflected in conflicting phylogenetic and biogeographic reconstructions. This study employs a recently de...
متن کاملSparse ACEKF for phase reconstruction.
We propose a novel low-complexity recursive filter to efficiently recover quantitative phase from a series of noisy intensity images taken through focus. We first transform the wave propagation equation and nonlinear observation model (intensity measurement) into a complex augmented state space model. From the state space model, we derive a sparse augmented complex extended Kalman filter (ACEKF...
متن کاملDistributed Algorithms for Sparse Reconstruction
Many applications require the knowledge of a sparse linear combination of elementary signals that can explain a given signal. This problem is known as “sparse approximation problem” and arises in many fields of electrical engineering and applied mathematics. The great difficulty when dealing with sparse approximation problems is the lack of convexity or the non-differentiability inherent to the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2015
ISSN: 1019-7168,1572-9044
DOI: 10.1007/s10444-015-9403-6